Treewidth: Computational Experiments

Treewidth: Computational Experiments

ManyNP-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for many optimization problems. To apply a tree decomposition ...

Computational Aspects of Treewidth

Treewidth and the Computational Complexity of MAP Approximations

The problem of finding the most probable explanation to a designated set of variables (the MAP problem) is a notoriously intractable problem in Bayesian networks, both to compute exactly and to approximate. It is known, both from theoretical considerations and from practical experiences, that low treewidth is typically an essential prerequisite to efficient exact computations in Bayesian networ...

Experiments with Computational Creativity

Neurocognitive model inspired by the putative processes in the brain has been applied to invention of novel words. This domain is proposed as the simplest way to understand creativity using experimental and computational means. Three factors are essential for creativity in this domain: knowledge of the statistical language properties, imagination constrained by this knowledge, and filtering of ...

Computational Experiments and Reality

This study explores three alternative econometric interpretations of dynamic, stochastic general equilibrium (DSGE) models. (1) A strong econometric interpretation takes the model literally and directly produces a likelihood function for observed prices and quantities. It is widely recognized that under this interpretation, most DSGE models are rejected using classical econometrics and assigned...